class Solution {
public:
    bool checkPartitioning(string s) {
        int n = s.size();
        vector<vector<bool>> dp(n, vector<bool>(n));

        for (int i = n - 1; i >= 0; --i)
        {
            for (int j = i; j < n; ++j)
            {
                if (s[i] == s[j])
                    dp[i][j] = i + 1 < j ? dp[i + 1][j - 1] : true;
            }
        }

        for (int i = 1; i < n; ++i)
        {
            if (dp[0][i - 1])
            {
                for (int j = i; j < n - 1; ++j)
                {
                    if (dp[i][j] && dp[j + 1][n - 1])
                        return true;
                }
            }
        }
        return false;
    }
};